Particle swarm optimization for time-optimal spacecraft reorientation with keep-out cones

This paper deals with the problem of spacecraft time-optimal reorientation maneuvers under boundaries and path constraints. The minimum time solution with keep-out constraints is proposed using the particle swarm optimization technique. A novel method based on the evolution of the kinematics and the successive obtainment of the control law is presented and named as inverse dynamics particle swarm optimization. It is established that the computation of the minimum time maneuver with the proposed technique leads to near-optimal solutions, which fully satisfy all the boundaries and path constraints.